// 爬楼梯

package Leetcode;

class solution_070 {
    public int climbStairs(int n) {
        if(n <= 2)
            return n;
        int[] dp = new int[n + 1];
        dp[1] = 1;
        dp[2] = 2;
        for (int i = 3; i < n + 1; i++) {
            dp[i] = dp[i - 2] + dp[i - 1];
        }
        return dp[n];
    }
}

public class Solution070 {

}
